System providing faster and more efficient data communication

ABSTRACT

A system designed for increasing network communication speed for users, while lowering network congestion for content owners and ISPs. The system employs network elements including an acceleration server, clients, agents, and peers, where communication requests generated by applications are intercepted by the client on the same machine. The IP address of the server in the communication request is transmitted to the acceleration server, which provides a list of agents to use for this IP address. The communication request is sent to the agents. One or more of the agents respond with a list of peers that have previously seen some or all of the content which is the response to this request (after checking whether this data is still valid). The client then downloads the data from these peers in parts and in parallel, thereby speeding up the Web transfer, releasing congestion from the Web by fetching the information from multiple sources, and relieving traffic from Web servers by offloading the data transfers from them to nearby peers.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation application of U.S.non-provisional patent application no. 14/025,109, filed Sep. 12, 2013,which is a divisional application of U.S. non-provisional patentapplication entitled “SYSTEM AND METHOD FOR PROVIDING FASTER AND MOREEFFICIENT DATA COMMUNICATION” having Ser. No. 12/836,059, filed Jul. 14,2010 and issued as U.S. Pat. No. 8,560,604 on Oct. 15, 2013, and claimspriority to U.S. provisional patent application entitled “SYSTEM ANDMETHOD FOR REDUCING INTERNET CONGESTION,” having Ser. No. 61/249,624,filed Oct. 8, 2009, which are hereby incorporated herein by reference intheir entirety.

FIELD OF THE INVENTION

The present invention is related to Internet communication, and moreparticularly, to improving data communication speed and bandwidthefficiency on the Internet.

BACKGROUND OF THE INVENTION

There are several trends in network and Internet usage, whichtremendously increase the bandwidth that is being used on the Internet.One such trend is that more and more video is being viewed on demand onthe Internet. Such viewing includes the viewing of both large and shortvideo clips. In addition, regular shows and full-featured films may beviewed on the Internet. Another trend that is increasing the traffic onthe Internet is that Web sites (such as shopping portals, news portals,and social networks) are becoming global, meaning that the Web sites areserving people in many diverse places on the globe, and thus the data istraversing over longer stretches of the Internet, increasing thecongestion.

The increase in bandwidth consumption has created several majorproblems, a few of which are described below:

The problem for users—the current Internet bandwidth is not sufficient,and thus the effective ‘speed’ experienced by users is slow;The problem for content owners—the tremendous amount of data beingviewed by users is costing large amounts of money in hosting andbandwidth costs; andThe problem for Internet Service Providers (ISPs)—the growth in Internettraffic is requiring the ISPs to increase the infrastructure costs(communication lines, routers, etc.) at tremendous financial expense.

The need for a new method of data transfer that is fast for theconsumer, cheap for the content distributor and does not requireinfrastructure investment for ISPs, has become a major issue which isyet unsolved.

There have been many attempts at making the Internet faster for theconsumer and cheaper for the broadcaster. Each such attempt is lackingin some aspect to become a widespread, practical solution, or is apartial solution in that it solves only a subset of the major problemsassociated with the increase in Internet traffic. Most of the previoussolutions require billions of dollars in capital investment for acomprehensive solution. Many of these attempts are lacking in that muchof the content on the Internet has become dynamically created per theuser and the session of the user (this is what used to be called the“Web2.0” trend). This may be seen on the Amazon Web site and theSalesforce Web site, for example, where most of the page views on theseWeb sites is tailored to the viewer, and is thus different for any twoviewers. This dynamic information makes it impossible for most of thesolutions offered to date to store the content and provide it to othersseeking similar content.

One solution that has been in use is called a “proxy”. FIG. 1 is aschematic diagram providing an example of use of a proxy within anetwork 2. A proxy, or proxy server 4, 6, 8 is a device that is placedbetween one or more clients, illustrated in FIG. 1 as client devices 10,12, 14, 16, 18, 20, that request data, via the Internet 22, and a Webserver or Web servers 30, 32, 34 from which they are requesting thedata. The proxy server 4, 6, 8 requests the data from the Web servers30, 32, 34 on their behalf, and caches the responses from the Webservers 30, 32, 34, to provide to other client devices that make similarrequests. If the proxy server 4, 6, 8 is geographically close enough tothe client devices 10, 12, 14, 16, 18, 20, and if the storage andbandwidth of the proxy server 4, 6, 8 are large enough, the proxy server4, 6, 8 will speed up the requests for the client devices 10, 12, 14,16, 18, 20 that it is serving.

It should be noted, however, that to provide a comprehensive solutionfor Internet surfing, the proxy servers of FIG. 1 would need to bedeployed at every point around the world where the Internet is beingconsumed, and the storage size of the proxy servers at each locationwould need to be near the size of all the data stored anywhere on theInternet. The abovementioned would lead to massive costs that areimpractical. In addition, these proxy solutions cannot deal well withdynamic data that is prevalent now on the Web.

There have been commercial companies, such as Akamai, that have deployedsuch proxies locally around the world, and that are serving a selectsmall group of sites on the Internet. If all sites on the Web were to besolved with such a solution, the capital investment would be in therange of billions of dollars. In addition, this type of solution doesnot handle dynamic content.

To create large distribution systems without the large hardware costsinvolved with a proxy solution, “peer-to-peer file sharing” solutionshave been introduced, such as, for example, BitTorrent. FIG. 2 is aschematic diagram providing an example of a peer-to-peer file transfernetwork 50. In the network 50, files are stored on computers ofconsumers, referred to herein as client devices 60. Each consumer canserve up data to other consumers, via the Internet 62, thus taking theload of serving off of the distributors and saving them the associatedcosts, and providing the consumer multiple points from which to downloadthe data, referred to herein as peers 70, 72, 74, 76, 78, thusincreasing the speed of the download. However, each such peer-to-peersolution must have some sort of index by which to find the requireddata. In typical peer-to-peer file sharing systems, because the index ison a server 80, or distributed among several servers, the number offiles available in the system is not very large (otherwise, the servercosts would be very large, or the lookup time would be very long).

The peer-to-peer file sharing solution is acceptable in file sharingsystems, because there are not that many media files that are ofinterest to the mass (probably in the order of magnitude of millions ofmovies and songs that are of interest). Storing and maintaining an indexof millions of entries is practical technically and economically.However, if this system were to be used to serve the hundreds ofbillions of files that are available on the Internet of today, the costof storing and maintaining such an index would be again in the billionsof dollars. In addition, these types of peer-to-peer file sharingsystems are not able to deal with dynamic HTTP data.

In conclusion, a system does not exist that enables fast transmission ofmost of the data on the Internet, that does not incur tremendous costs,and/or that provides only a very partial solution to the problem ofInternet traffic congestion. Thus, a heretofore unaddressed need existsin the industry to address the aforementioned deficiencies andinadequacies.

SUMMARY OF THE INVENTION

The present system and method provides for faster and more efficientdata communication within a communication network. Briefly described, inarchitecture, one embodiment of the system, among others, can beimplemented as follows. A network is provided for accelerating datacommunication, wherein the network contains: at least one clientcommunication device for originating a data request for obtaining thedata from a data server; at least one agent communication device whichis assigned to the data server for receiving the data request from theclient communication device, wherein the agent keeps track of whichclient communication devices have received responses to data requestsfrom the assigned data server; at least one peer communication devicefor storing portions of data received in response to the data request bythe at least one client communication device, wherein the portions ofdata may be transmitted to the at least one client communication deviceupon request by the client communication device; and at least oneacceleration server for deciding which agent communication device is tobe assigned to which data server and providing this information to theat least one client communication device.

The present system and method also provides a communication devicewithin a network, wherein the communication device contains: a memory;and a processor configured by the memory to perform the steps of:originating a data request for obtaining data from a data server; beingassigned to a data server, referred to as an assigned data server;receiving a data request from a separate device within the network, andkeeping track of which client communication devices within the networkhave received responses to data requests from the assigned data server;and storing portions of data received in response to the originated datarequest, wherein the portions of data may be transmitted tocommunication device upon request by the communication device.

Other systems, methods, features, and advantages of the presentinvention will be or become apparent to one with skill in the art uponexamination of the following drawings and detailed description. It isintended that all such additional systems, methods, features, andadvantages be included within this description, be within the scope ofthe present invention, and be protected by the accompanying claims.

BRIEF DESCRIPTION OF THE DRAWINGS

Many aspects of the invention can be better understood with reference tothe following drawings. The components in the drawings arc notnecessarily to scale, emphasis instead being placed upon clearlyillustrating the principles of the present invention. Moreover, in thedrawings, like reference numerals designate corresponding partsthroughout the several views.

FIG. 1 is a schematic diagram providing a prior art example of use of aproxy within a network.

FIG. 2 is a schematic diagram providing a prior art example of apeer-to-peer file transfer network.

FIG. 3 is a schematic diagram providing an example of a communicationnetwork in accordance with the present invention.

FIG. 4 is a schematic diagram further illustrating a communicationdevice of the communication network of FIG. 3.

FIG. 5 is a schematic diagram further illustrating the memory of FIG. 4.

FIG. 6 is a schematic diagram further illustrating elements of theacceleration application of FIG. 5, as well as communication paths ofthe acceleration application.

FIG. 7 is a chart further illustrating two of the main databasesutilized within the communication network.

FIG. 8 is a flowchart illustrating operation of the acceleration systeminitializer module.

FIG. 9 is a flowchart further illustrating communication betweendifferent elements of the communication network.

FIG. 10 is a flowchart continuing the flowchart of FIG. 9 and focused onagent response to the HTTP request.

FIG. 11 is a flowchart continuing the flowchart of FIG. 10, whichillustrates actions taken upon receipt of the list of peers, or singlepeer listing, from the agent.

FIG. 12 is a flowchart illustrating steps taken by an agent, client, orpeer to determine whether a certain HTTP request is still valid.

FIG. 13 is a flowchart outlining operation of the acceleration server.

FIG. 14 is a flowchart further illustrating TCPIP acceleration inaccordance with an alternative embodiment of the invention.

FIG. 15 is a flowchart further illustrating TCPIP acceleration inaccordance with an alternative embodiment of the invention, detailingthe communication between the client and the TCPIP server (read andwrite commands) after the connect phase has completed successfully.

DETAILED DESCRIPTION

The present system and method provides for faster and more efficientdata communication within a communication network. An example of such acommunication network 100 is provided by the schematic diagram of FIG.3. The network 100 of FIG. 3 contains multiple communication devices.Due to functionality provided by software stored within eachcommunication device, which may be the same in each communicationdevice, each communication device may serve as a client, peer, or agent,depending upon requirements of the network 100, as is described indetail herein. It should be noted that a detailed description of acommunication device is provided with regard to the description of FIG.4.

Returning to FIG. 3, the exemplary embodiment of the network 100illustrates that one of the communication devices is functioning as aclient 102. The client 102 is capable of communication with one or morepeers 112, 114, 116 and one or more agents 122. For exemplary purposes,the network contains three peers and one agent, although it is notedthat a client can communicate with any number of agents and peers.

The communication network 100 also contains a Web server 152. The Webserver 152 is the server from which the client 102 is requestinginformation and may be, for example, a typical HTTP server, such asthose being used to deliver content on any of the many such servers onthe Internet. It should be noted that the server 152 is not limited tobeing an HTTP server. In fact, if a different communication protocol isused within the communication network, the server may be a servercapable of handling a different protocol. It should also be noted thatwhile the present description refers to the use of HTTP, the presentinvention may relate to any other communication protocol and HTTP is notintended to be a limitation to the present invention.

The communication network 100 further contains an acceleration server162 having an acceleration server storage device 164. As is described inmore detail herein, the acceleration server storage device 164 hascontained therein an acceleration server database. The accelerationserver database stores Internet protocol (IP) addresses of communicationdevices within the communication network 100 having accelerationsoftware stored therein. Specifically, the acceleration server databasecontains stored therein a list of communication devices havingacceleration software stored therein that are currently online withinthe communication network 100. For each such agent, the accelerationserver assigns a list of IP addresses.

In the communication network 100 of FIG. 3, the application in theclient 102 is requesting information from the Web server 152, which iswhy the software within the communication device designated thiscommunication device to work as a client. In addition, since the agent122 receives the request from the client 102 as the communication deviceclosest to the Web server 152, functionality of the agent 122, asprovided by the software of the agent 122, designates this communicationdevice to work as an agent. It should be noted, that in accordance withan alternative embodiment of the invention, the agent need not be thecommunication device that is closest to the Web server. Instead, adifferent communication device may be selected to be the agent.

Since the peers 112, 114, 116 contain at least portions of theinformation sought by the client 102 from the Web server 152,functionality of the peers 112, 114, 116, as provided by the software ofthe peers 112, 114, 116, designates these communication devices to workas peers. It should be noted that the process of designating clients,agents, and peers is described in detail herein. It should also be notedthat the number of clients, agents, peers, acceleration servers, Webservers, and other components of the communication network 100 maydiffer from the number illustrated by FIG. 3. In fact, the number ofclients, agents, peers, acceleration servers, Web servers, and othercomponents of the communication network 100 are not intended to belimited by the current description.

Prior to describing functionality performed within a communicationnetwork 100, the following further describes a communication device 200,in accordance with a first exemplary embodiment of the invention. FIG. 4is a schematic diagram further illustrating a communication device 200of the communication network 100, which contains general components of acomputer. As previously mentioned, it should be noted that thecommunication device 200 of FIG. 4 may serve as a client, agent, orpeer.

Generally, in terms of hardware architecture, as shown in FIG. 4, thecommunication device 200 includes a processor 202, memory 210, at leastone storage device 208, and one or more input and/or output (I/O)devices 240 (or peripherals) that are communicatively coupled via alocal interface 250. The local interface 250 can be, for example but notlimited to, one or more buses or other wired or wireless connections, asis known in the art. The local interface 250 may have additionalelements, which are omitted for simplicity, such as controllers, buffers(caches), drivers, repeaters, and receivers, to enable communications.Further, the local interface 250 may include address, control, and/ordata connections to enable appropriate communications among theaforementioned components.

The processor 202 is a hardware device for executing software,particularly that stored in the memory 210. The processor 52 can be anycustom made or commercially available processor, a central processingunit (CPU), an auxiliary processor among several processors associatedwith the communication device 200, a semiconductor based microprocessor(in the form of a microchip or chip set), a macroprocessor, or generallyany device for executing software instructions.

The memory 210, which is further illustrated and described by thedescription of FIG. 5, can include any one or combination of volatilememory elements (e.g., random access memory (RAM, such as DRAM, SRAM,SDRAM, etc.)) and nonvolatile memory elements (e.g., ROM, hard drive,tape, CDROM, etc.). Moreover, the memory 210 may incorporate electronic,magnetic, optical, and/or other types of storage media. Note that thememory 210 can have a distributed architecture, where various componentsare situated remote from one another, but can be accessed by theprocessor 202.

The software 212 located within the memory 210 may include one or moreseparate programs, each of which contains an ordered listing ofexecutable instructions for implementing logical functions of thecommunication device 200, as described below. In the example of FIG. 4,the software 212 in the memory 210 at least contains an accelerationapplication 220 and an Internet browser 214. In addition, the memory 210may contain an operating system (O/S) 230. The operating system 230essentially controls the execution of computer programs and providesscheduling, input-output control, file and data management, memorymanagement, and communication control and related services. It should benoted that, in addition to the acceleration application 220, Internetbrowser 214, and operating system 230, the memory 210 may contain othersoftware applications.

While the present description refers to a request from the clientoriginating from an Internet browser, the present invention is notlimited to requests originating from Internet browsers. Instead, arequest may originate from an email program or any other program thatwould be used to request data that is stored on a Web server, or otherserver holding data that is requested by the client device.

Functionality of the communication device 200 may be provided by asource program, executable program (object code), script, or any otherentity containing a set of instructions to be performed. When a sourceprogram, then the program needs to be translated via a compiler,assembler, interpreter, or the like, which may or may not be includedwithin the memory 210, so as to operate properly in connection with theoperating system 230. Furthermore, functionality of the communicationdevice 200 can be written as (a) an object oriented programminglanguage, which has classes of data and methods, or (b) a procedureprogramming language, which has routines, subroutines, and/or functions.

The I/O devices 240 may include input devices, for example but notlimited to, a keyboard, mouse, scanner, microphone, etc. Furthermore,the I/O devices 240 may also include output devices, for example but notlimited to, a printer, display, etc. Finally, the I/O devices 240 mayfurther include devices that communicate via both inputs and outputs,for instance but not limited to, a modulator/demodulator (modem; foraccessing another device, system, or network), a radio frequency (RF) orother transceiver, a telephonic interface, a bridge, a router, etc.

When the communication device 200 is in operation, the processor 202 isconfigured to execute the software 212 stored within the memory 210, tocommunicate data to and from the memory 210, and to generally controloperations of the communication device 200 pursuant to the software 212.The software 212 and the O/S 230, in whole or in part, but typically thelatter, are read by the processor 202, perhaps buffered within theprocessor 202, and then executed.

When functionality of the communication device 200 is implemented insoftware, as is shown in FIG. 4, it should be noted that thefunctionality can be stored on any computer readable medium for use byor in connection with any computer related system or method. In thecontext of this document, a computer readable medium is an electronic,magnetic, optical, or other physical device or means that can contain orstore a computer program for use by or in connection with a computerrelated system or method. The functionality of the communication device200 can be embodied in any computer-readable medium for use by or inconnection with an instruction execution system, apparatus, or device,such as a computer-based system, processor-containing system, or othersystem that can fetch the instructions from the instruction executionsystem, apparatus, or device and execute the instructions. In thecontext of this document, a “computer-readable medium” can be any meansthat can store, communicate, propagate, or transport the program for useby or in connection with the instruction execution system, apparatus, ordevice.

The computer readable medium can be, for example but not limited to, anelectronic, magnetic, optical, electromagnetic, infrared, orsemiconductor system, apparatus, device, or propagation medium. Morespecific examples (a non-exhaustive list) of the computer-readablemedium would include the following: an electrical connection(electronic) having one or more wires, a portable computer diskette(magnetic), a random access memory (RAM) (electronic), a read-onlymemory (ROM) (electronic), an erasable programmable read-only memory(EPROM, EEPROM, or Flash memory) (electronic), an optical fiber(optical), and a portable compact disc read-only memory (CDROM)(optical). Note that the computer-readable medium could even be paper oranother suitable medium upon which the program is printed, as theprogram can be electronically captured, via for instance opticalscanning of the paper or other medium, then compiled, interpreted orotherwise processed in a suitable manner if necessary, and then storedin a computer memory.

In an alternative embodiment, where the functionality of thecommunication device 200 is implemented in hardware, the functionalitycan be implemented with any or a combination of the followingtechnologies, which are each well known in the art: a discrete logiccircuit(s) having logic gates for implementing logic functions upon datasignals, an application specific integrated circuit (ASIC) havingappropriate combinational logic gates, a programmable gate array(s)(PGA), a field programmable gate array (FPGA), etc.

The at least one storage device 208 of the communication device 200 maybe one of many different categories of storage device. As is describedin more detail herein, the storage device 208 may include aconfiguration database 280 and a cache database 282. Alternatively, theconfiguration database 280 and cache database 282 may be located ondifferent storage devices that are in communication with thecommunication device 200. The description that follows assumes that theconfiguration database 280 and cache database 282 are located on thesame storage device, however, it should be noted that the presentinvention is not intended to be limited to this configuration.

The configuration database 280 stores configuration data that is commonto all elements of the communication network 100 and is used to provideset up and synchronization information to different modules of theacceleration application 220 stored within the memory 210, as isdescribed in further detail herein. The cache database 282 storesresponses to HTTP requests that the communication device 200 hasdispatched, either for its own consumption or on behalf of otherelements of the communication network 100. As is explained in additionaldetail herein, the responses to HTTP requests are stored within thecache database 282 for future use by this communication device 200, orfor other communication devices within the communication network 100that need to retrieve this information and will use this communicationdevice as either a peer or an agent.

In addition to the abovementioned, as is explained in further detailherein, the cache database 282 has stored therein a list of URLs thatthe communication device is aware of (i.e., has seen requests for). Foreach URL, the cache database 282 has stored therein the URL itself, HTTPheaders returned by the Web Server for this URL, when the last time wasthat the contents of this URL was loaded directly from the Web Server,when the contents of the URL had last changed on the Web Server, as wellas a list of chunks that contain the contents of this URL, and thechunks of data themselves. Chunks in the present description are definedas equally sized pieces of data that together form the whole content ofthe URL. It should be noted that while the present description providesfor chunks being equally sized pieces of data, in accordance with analternative embodiment of the invention, the chunks may instead be ofdifferent size.

FIG. 5 is a schematic diagram further illustrating the memory 210 ofFIG. 4. As shown by FIG. 5, the memory 210 may be separated into twobasic levels, namely, an operating system level 260 and an applicationlevel 270. The operating system level 260 contains the operating system230, wherein the operating system 230 further contains at least onedevice driver 262 and at least one communication stack 264. The devicedrivers 262 are software modules that are responsible for the basicoperating commands for various hardware devices of the communicationdevice 200, such as the processor 202, the storage device 208 and theI/O devices 240. In addition, the communication stacks 264 provideapplications of the communication device 200 with a means ofcommunicating within the network 100 by implementing various standardcommunication protocols.

The application level 270 includes any application that is running onthe communication device 200. As a result, the application level 270includes the Internet browser 214, which is used to view informationthat is located on remote Web servers, the acceleration application 220,as described in more detail below, and any other applications 216 storedon the communication device 200.

As is explained in additional detail below, the acceleration application220 intercepts the requests being made by applications of thecommunication device (client) that use the Internet, in order to modifythe requests and route the requests through the communication network.There are various methods that may be used to intercept such requests.One such method is to create an intermediate driver 272, which is alsolocated within the memory 210, that attaches itself to all communicationapplications, intercepts outgoing requests of the communicationapplications of the communication device 200, such as the Internetbrowser 214, and routes the requests to the acceleration application220. Once the acceleration application 220 modifies the requests, routesthe requests to other system elements on the communication network 100,and receives replies from other system elements of the communicationnetwork 100, the acceleration application 220 returns the replies to theintermediate driver 272, which provides the replies back to therequesting communication application.

FIG. 6 is a schematic diagram further illustrating elements of theacceleration application 220, as well as communication paths of theacceleration application 220. The acceleration application 220 containsan acceleration system initializer module 222, which is called when theacceleration application 220 is started. The acceleration systeminitializer module 222 is capable of initializing all elements of thecommunication device 200 The acceleration application 220 also containsthree separate modules that run in parallel, namely, a client module224, a peer module 226, and an agent module 228, each of which comesinto play according to the specific role that the communication device200 is partaking in the communication network 100 at a given time. Therole of each module is further described herein.

The client module 224 provides functionality required when thecommunication device 200 is requesting information from the Web server152, such as, for example, but not limited to, Web pages, data, video,or audio. The client module 224 causes the communication device 200having the client module 224 therein to intercept the informationrequest and pass the information request on to other elements of thecommunication network 100, such as, servers, agents or peers. Thisprocess is further described in detail herein.

The peer module 226 provides functionality required by the communicationdevice 200 when answering other clients within the communication network100 and providing the other clients with information that they request,which this communication device 200, having this peer module 226therein, has already downloaded at a separate time. This process isfurther described in detail herein.

The agent module 228 provides functionality required when othercommunication devices of the communication network 100 acting as clientsquery this communication device 200, having this agent module 228therein, as an agent, to obtain a list of peers within the communicationnetwork 100 that contain requested information. This process is furtherdescribed in detail herein.

The acceleration application 220 interacts with both the configurationdatabase 280 and the cache database 282 of the storage device 208. Aspreviously mentioned herein, the configuration database 280 storesconfiguration data that may be common to all communication devices ofthe communication network 100 and is used to provide setup andsynchronization information to different modules 222, 224, 226, 228 ofthe acceleration application 220 stored within the memory 210.

The cache database 282 stores responses to information requests, suchas, for example, HTTP requests, that the communication device 200 hasdispatched, either for its own consumption or on behalf of otherelements of the communication network 100. The responses to HTTPrequests are stored within the cache database 282 for future use by thiscommunication device 200, or for other communication devices within thecommunication network 100 that need to retrieve this same informationand will use this communication device 200 as either a peer or an agent.This process is described in detail herein.

Information stored within the cache database 282 may include anyinformation associated with a request sent by the client. As an example,such information may include, metadata and actual requested data. Forexample, for an HTTP request for a video, the metadata may include theversion of the Web server answering the request from the client and thedata would be the requested video itself. In a situation where there isno more room for storage in the cache database, the software of theassociated communication device may cause the communication device toerase previous data stored in order to clear room for the new data tostore in the cache database. As an example, such previous data mayinclude data that is most likely not to be used again. Such data may beold data or data that is known to no longer be valid. The communicationdevice may choose to erase the least relevant data, according to any ofseveral methods that are well known in the art.

FIG. 7 is a chart further illustrating two of the main databasesutilized within the communication network 100, namely, the accelerationserver database 164 and the cache database 282. As previously mentioned,the acceleration server database 164 stores IP addresses ofcommunication devices located within the communication network 100,which have acceleration software stored therein. Specifically, theacceleration server database 164 contains stored therein a list ofcommunication devices having acceleration software stored therein thatare currently online within the communication network 100. Theacceleration server assigns a list of IP addresses to each communicationdevice functioning as an agent. Each communication device will be theagent for any Web servers whose IP address is in the range ‘owned’ bythat communication device. As an example, when a first evercommunication device goes online, namely, the first communication deviceas described herein having the acceleration application 220 therein, theacceleration server assigns all IP addresses in the world to thiscommunication device, and this communication device will be the agentfor any Web server. When a second communication device goes online itwill share the IP address list with the first communication device, sothat each of the communication devices will be responsible for adifferent part of the world wide web servers.

The cache database 282 of the communication device 200 has storedtherein a list of URLs 286 of which the communication device 200 isaware. The communication device 200 becomes aware of a URL each timethat the communication device 200 receives a request for informationlocated at a specific URL. As shown by FIG. 7, for each URL 288 withinthe list of URLs 286, the cache database 282 stores: the URL itself 290;HTTP headers 292 returned by the Web Server 152 for this URL; when thelast time 294 was that the contents of this URL were loaded directlyfrom the Web Server 152; when the contents of the URL last changed 296on the Web Server 152; and a list of chunks 298 that contain thecontents of this URL, and the content of the chunk. As previouslymentioned, chunks, in the present description, are defined as equallysized pieces of data that together form the entire content of the URL,namely, the entire content whose location is described by the URL. As anon-limiting example, a chunk size of, for example, 16 KB can be used,so that any HTTP response will be split up into chunks of 16 KB. Inaccordance with an alternative embodiment of the invention, if the lastchunk of the response is not large enough to fill the designated chunksize, such as 16 KB for the present example, the remaining portion ofthe chunk will be left empty.

For each such chunk 300, the cache database 282 includes the checksum ofthe chunk 302, the data of the chunk 304 itself, and a list of peers 306that most likely have the data for this chunk. As is described inadditional detail herein, the data for the chunk may be used by otherclients within the communication network 100 when other communicationdevices of the communication network 100 serve as peers to the clients,from which to download the chunk data.

For each chunk, a checksum is calculated and stored along side of thechunk itself. The checksum may be calculated in any of numerous waysknown to those in the art. The purpose of having the checksum is to beable to identify data uniquely, whereas the checksum is the “key” to thedata, where the data is the chunk. As an example, a client may want toload the contents of a URL, resulting in the agent that is servicingthis request sending the checksums of the chunks to the client, alongwith the peers that store these chunks. It is to be noted that therecould be a different peer for every different chunk. The client thencommunicates with each such peer, and provides the checksum of the chunkthat it would like the peer to transmit back to the client. The peerlooks up the checksum (the key) in its cache database, and provides backthe chunk (data) that corresponds to this checksum (the key). As shownby FIG. 7, for each peer 308 within the list of peers 306, the cachedatabase 282 includes the peer IP address 310, as well as the connectionstatus 312 of the peer, which represents whether the peer 308 is onlineor not.

In accordance with one embodiment of the invention, the cache database282 may be indexed by URL and by Checksum. Having the cache databaseindexed in this manner is beneficial due to the following reason. Whenthe agent is using the cache database, the agent receives a request froma client for the URL that the client is looking for. In such a case theagent needs the cache database to be indexed by the URL, to assist infinding a list of corresponding peers that have the chunks of this URL.When the peers are using this cache database, the peers obtain a requestfrom the client for a particular checksum, and the peers need thedatabase to be indexed by the checksum so that they can quickly find thecorrect chunk. Of course, as would be understood by one having ordinaryskill in the art, the cache database may instead be indexed in any othermanner.

Having described components of the communication network 100, thefollowing further describes how such components interact andindividually function. FIG. 8 is a flowchart 300 illustrating operationof the acceleration system initializer module 222 (hereafter referred toas the initializer 222 for purposes of brevity). It should be noted thatany process descriptions or blocks in flowcharts should be understood asrepresenting modules, segments, portions of code, or steps that includeone or more instructions for implementing specific logical functions inthe process, and alternative implementations are included within thescope of the present invention in which functions may be executed out oforder from that shown or discussed, including substantially concurrentlyor in reverse order, depending on the functionality involved, as wouldbe understood by those reasonably skilled in the art of the presentinvention.

The initializer 222 is the first element of the communication device 200to operate as the communication device 200 starts up (block 302). As theinitializer 222 starts, it first communicates with the accelerationserver 162 to sign up with the acceleration server 162. This isperformed by providing the acceleration server 162 with the hostname,and all IP addresses and media access control (MAC) addresses of theinterfaces on the communication device 200 having the initializer 222thereon.

In accordance with an alternative embodiment of the invention, as shownby block 304, the initializer 222 checks with the acceleration server162 whether a more updated version of the acceleration applicationsoftware is available. This may be performed by any one of many knownmethods, such as, but not limited to, by providing the version number ofthe acceleration application software to the acceleration server 162.The message received back from the acceleration server 162 indicateswhether there is a newer version of the acceleration applicationsoftware or not. If a newer version of the acceleration applicationsoftware exists, the initializer 222 downloads the latest version of theacceleration application software from the acceleration server 162, orfrom a different location, and installs the latest version on thecommunication device 200. In addition to the abovementioned, theinitializer 222 may also schedule additional version checks for everyset period of time thereafter. As an example, the initializer 222 maycheck for system updates every two days.

As shown by block 306, the initializer 222 then redirects outgoingnetwork traffic from the communication device 200 to flow through theacceleration application 162. As previously mentioned, one way toredirect the outgoing network traffic is to insert an intermediatedriver 212 that intercepts and redirects the traffic. It should be notedthat there are many other ways to implement this redirection, which arewell known to those having ordinary skill in the art.

As shown by block 308, the initializer 222 then launches the clientmodule 224 of the communication device 200, and configures the clientmodule 224 of the communication device 200 to intercept to all outgoingnetwork communications of the communication device 200 and route theoutgoing network communications to the client module 224, from theintermediate driver 272 or other routing method implemented. This isperformed so that the client module 224 is able to receive all networktraffic coming from the network applications, modify the network trafficif necessary, and re-route the traffic. As is known by those havingordinary skill in the art, in order to re-route the traffic, the trafficneeds to be modified, as an example, to change the destination ofrequests.

As shown by block 310, the initializer 222 then launches the agentmodule 228 and the peer module 226 to run on the communication device200. The agent module 228 and peer module 226 listen on pre-determinedports of the communication device 200, so that incoming network trafficon these ports gets routed to the agent module 228 and peer module 226.As is explained in further detail herein, the abovementioned enables thecommunication device 200 to function as an agent and as a peer for othercommunication devices within the communication network 100, as needed.

FIG. 9 is a flowchart 350 further illustrating communication betweendifferent elements of the communication network 100, in accordance withthe present system and method for providing faster and more efficientdata communication.

As shown by block 352, an application running on the client 200initiates a request for a resource on a network. Such a request may be,for example, “GET http://www.aol.com/index.html HTTP/1.1”. The requestmay come from an Internet browser 214 located on the client 200, wherethe Internet browser 214 is loading a page from the Internet, anapplication that wants to download information from the Internet, fetchor send email, or any other network communication request.

Through the intermediate driver 272, or other such mechanism as may beimplemented that is re-routing the communication to the client module224 of the client 200, the resource request is intercepted by the clientmodule 224 that is running on the client 200 (block 354). The clientmodule 224 then looks up the IP address of the server 152 that is thetarget of the resource request (e.g., the IP address of the Web serverthat is the host of www.aol.com in the example above), and sends this IPaddress to the acceleration server 162 (block 356) in order to obtain alist of communication devices that the client 200 can use as agents(hereafter referred to as agents). It should be noted that the processof performing an IP lookup for a server is known by one having ordinaryskill in the art, and therefore is not described further herein.

In response to receiving the IP address of the server 152, theacceleration server 162 prepares a list of agents that may be suitableto handle the request from this IP address (block 358). The size of thelist can differ based on implementation. For exemplary purposes, thefollowing provides an example where a list of five agents is prepared bythe acceleration server 162. The list of agents is created by theacceleration server 162 by finding the communication devices of thecommunication network 100 that are currently online, and whose IPaddress is numerically close to the IP of the destination Web server152. A further description of the abovementioned process is describedhere in.

As shown by block 360, the client module 224 then sends the originalrequest (e.g., “GET http://www.aol.com/index.html HTTP/1.1”) to all theagents in the list received from the acceleration server 162 in order tofind out which of the agents in the list is best suited to be the oneagent that will assist with this request.

It should be noted that, in accordance with an alternative embodiment ofthe invention, the communication device 200 may be connected to a devicethat is actually requesting data. In such an alternative embodiment, thecommunication device would be a modular device connected to a requestingdevice, where the requesting device, such as, for example, a personaldata assistant (PDA) or other device, would request data, and thecommunication device connected thereto, either through a physicalconnection, wireless connection, or any other connection, would receivethe data request and function as described herein. In addition, aspreviously mentioned, it should be noted that the HTTP request may bereplaced by any request for resources on the Web.

FIG. 10 is a flowchart continuing the flowchart 380 of FIG. 9 andfocused on agent response to the request. As shown by block 382, uponreceiving the request from the client 200, each agent that received therequest from the client responds to the client 200 with whether it hasinformation regarding the request, which can help the client to downloadthe requested information from peers in the network. Specifically, eachagent responds with whether the agent has seen a previous request forthis resource that has been fulfilled. In such a case, the agent maythen provide the client with the list of peers and checksums of thechunks that each of them have.

As shown by block 384, the client then decides which of the agents inthe list to use as its agent for this particular information request. Todetermine which agent in the list to use as its agent for the particularinformation request, the client may consider multiple factors, such as,for example, factoring the speed of the reply by each agent and whetherthat agent does or does not have the information required. There aremultiple ways to implement this agent selection, one practical way beingto start a timer of a small window of time, such as, for example, 5 ms,after receiving the first response from the agents, and after the smallwindow, choosing from the list of agents that responded, the agent thathas the information about the request, or in the case that none of theagents responded, to choose the first agent from the list received fromthe acceleration server 162.

As shown by block 386, after selecting an agent, the client notifies theselected agent that it is going to use it for this request, and notifiesthe other agents that they will not be used for this request. The clientthen sends the selected agent a request for the first five chunks ofdata of the original information request (block 388). By specifying tothe selected agent the requested chunks by their order in the fullresponse, the client receives the peer list and checksums of therequested chunks from the selected agent. As an example, for the firstfive chunks the client will ask the selected agent for chunks onethrough five, and for the fourth batch of five chunks the client willask the agent for chunks sixteen through twenty. As previouslymentioned, additional or fewer chunks may be requested at a single time.

As shown by block 390, after receiving the request from the client, theselected agent determines whether it has information regarding therequested chunks of data by looking up the request in its cache databaseand determining if the selected agent has stored therein informationregarding peers of the communication network that have stored therequested data of the request, or whether the selected agent itself hasthe requested data of the request stored in its memory. In addition todetermining if the selected agent contains an entry for this request inits database, the selected agent may also determine if this informationis still valid. Specifically, the selected agent determines whether thedata that is stored within the memory of the selected agent or thememory of the peers, still mirrors the information that would have beenreceived from the server itself for this request. A further descriptionof the process utilized by the selected agent to determine if theinformation is still valid, is described in detail herein.

As shown by block 392, if the information (requested data of therequest) exists and is still valid, then the agent prepares a responseto the client, which includes for each of the chunks: (i) the checksumof the chunk; (ii) a list of peers that according to the database of theselected agent contains these chunks; and (iii) if these are the firstfive chunks of the information, then the selected agent also providesthe specific protocol's headers that would have been received from theserver, had the initial request from the client been made directly tothe server.

As shown by block 394, the list of peers for each chunk is sorted bygeographical proximity to the requesting client. In accordance with thepresent example, only the five closest peers are kept in the list forevery chunk, and the rest of the peers are discarded from this list. Asshown by block 396, the prepared response, namely, the list of closestpeers, is sent back to the client. It should be noted that, if this werethe last set of chunks to be provided for this request, then it would bebeneficial to include information about this to the client.

If the selected agent discovers that it does not have information aboutthis request, or if the selected agent discovers that the information ithas is no longer valid, the selected agent needs to load the informationdirectly from the server in order to be able to provide an answer to therequesting client. As shown by block 400, the selected agent then sendsthe request directly to the server. The selected agent then stores theinformation it receives from the server (both the headers of therequest, as well as chunks of the response itself) in its database, forthis particular response to the client, as well as for future use toother clients that may request this data (block 402). The selected agentthen prepares a response (list) for the client, where the responseincludes the protocol headers (if these are the first five chunks), andthe checksums of the five chunks, and provides itself as the only peerfor these chunks (block 404). This list is then sent back to the client(block 406).

FIG. 11 is a flowchart 420 continuing the flowchart of FIG. 10, whichillustrates actions taken upon receipt of the list of peers, or singlepeer listing, from the agent. As shown by block 422, the client receivesthe response from the agent (including the list of chunks and theircorresponding data, including peers and other information previouslymentioned) and, for each of the five chunks, the client sends a requestto each of the peers listed for the chunk to download the chunk. Thechunk request that the client sends to each of the peers is the checksumof the data that the client seeks to receive, which is the key(identifier) of the chunk.

As shown by block 424, the peers then respond regarding whether theystill have the data of the chunk. As an example, some of the peers maynot currently be online, some may be online but may have discarded therelevant information, and some may still have the relevant information,namely, the chunk. As shown by block 426, the client then selects thequickest peer that responds with a positive answer regarding therequested information, the client lets that peer know that it is chosento provide the client with the chunk, and the client notifies the otherpeers that they are not chosen.

As shown by block 428, the chosen peer then sends the chunk to theclient. It should be noted that if no peers answer the request of theclient, the client goes back to the agent noting that the peers were allnegative, and the agent either provides a list of 5 other agents, ifthey exist, or the agent goes on to download the information directlyfrom the Web server as happens in the case where no peers exist asdescribed above.

The client then stores the chunks in its cache for future use (block430), when the client may need to provide the chunks to a requestingcommunication device when acting as a peer for another client that islooking for the same information. As shown by block 432, if some of thechunks were not loaded from any of the peers, the client requests thechunks again from the agent in a next round of requests, flagging thesechunks as chunks that were not loadable from the client list of peers.In this situation, the agent will load the data directly from the serverand provide it back to the client.

The client then acknowledges to the agent which of the chunks itreceived properly (block 434). The agent then looks up these chunks inthe database of the agent, and adds the client to the list of peers forthese chunks, specifically, since this client is now storing thesechunks, and can provide these chunks to other clients that turn to it asa peer (block 436).

As shown by block 438, the client then passes the data on to the Webbrowser or other application of the client that made the originalrequest, for it to use as it had originally intended. The client thenchecks whether all of the chunks for this request were received (block440), by checking the flag set by the agent. Specifically, when theagent is providing the list of the last 5 chunks, the agent includesthat information as part of its reply to the client, which is referredto herein as a flag. This information is what enables the client to knowthat all information has been received for a particular resourcerequest.

If the last received chunks were not the last chunks for this request,the processing flow of the client continues by returning to thefunctionality of block 384 of FIG. 10, but instead sending the chosenagent a request for the next five chunks of data of the originalinformation request. Alternatively, if all chunks for this request werereceived, the request is complete, and the flow starts again at block352 of FIG. 9.

FIG. 12 is a flowchart 500 illustrating steps taken by an agent, client,or peer to determine whether a certain HTTP request is still valid.Specifically, the following provides an example of how the agent,client, or peer can determine whether particular data that is storedwithin the memory of the agent, or the memory of a peer or client, stillmirrors the information that is currently on the Web server. As shown byblock 502, the HTTP request is looked up in the cache database of theagent, client or peer that is checking the validity of the HTTP request.As an example, the HTTP protocol, defined by RFC 2616, outlines specificmethods that Web servers can define within the HTTP headers signifyingthe validity of certain data, such as, but not limited to, by using HTTPheader information such as “max age” to indicate how long this data maybe cached before becoming invalid, “no cache” to indicate that the datamay never be cached, and using other information.

As shown by block 504, these standard methods of validation are testedon the HTTP request information in question. As shown by block 506, adetermination is made whether the requested information that is storedis valid or not. If the requested information is valid, a “VALID”response is returned (block 508). Alternatively, if the requestedinformation is not valid, an HTTP conditional request is sent to therelevant Web server, to determine if the data stored for this request isstill valid (block 510). If the data stored for this request is stillvalid, a “VALID” response is returned (block 508). Alternatively, if thedata stored for this request is not valid, an “INVALID” response isreturned (block 514). It should be noted, that the abovementioneddescription with regard to FIG. 12 is an explanation of how to check ifHTTP information is still valid. There are similar methods ofdetermining validity for any other protocol, which may be utilized, andwhich those having ordinary skill in the art would appreciate andunderstand.

FIG. 13 is a flowchart 550 outlining operation of the accelerationserver, whose main responsibility in the present system and method is toprovide clients with information regarding which agents serve whichrequests, and to keep the network elements all up to date with thelatest software updates. As shown by block 552, the acceleration serversends “keep alive” signals to the network elements, and keeps trackwithin its database as to which network elements are online. As shown byblock 554, the acceleration server continues to wait for a clientrequest and continues to determine if one is received.

Once a request is received, the acceleration server tests the type ofrequest received (block 556). If the client request is to sign up theclient within the network, an event that happens every time that theclient starts running on its host machine, then that client is added tothe list of agents stored on the acceleration server, sorted by the IPaddress of the client (block 558).

If the request is to find an agent to use for a particular request, theacceleration server creates a new agent list, which is empty (block560). The acceleration server then searches the agent database for thenext 5 active agents whose IP address is closest to the IP address ofthe server who is targeted in the request (block 562). In this context,192.166.3.103 is closer to 192.166.3.212 than to 192.167.3.104. Theacceleration server then sends this agent list to the client (block564).

If instead, the request is to check the version of the latestacceleration software then the acceleration server sends that networkelement (client, peer or agent) the version number of the latestexisting acceleration software version, and a URL from where to downloadthe new version, for the case that the element needs to upgrade to thenew version (block 566).

While the abovementioned example is focused on HTTP requests for data,as previously mentioned, other protocol requests are equally capable ofbeing handled by the present system and method. As an example, inseparate embodiments the acceleration method described may accelerateany communication protocol at any OSI layer (SMTP, DNS, UDP, ETHERNET,etc.). In the following alternative embodiment, it is illustrated howthe acceleration method may accelerate TCPIP. As is known by thosehaving ordinary skill in the art, TCPIP is a relatively low-levelprotocol, as opposed to HTTP, which is a high level protocol. Forpurposes of illustration of TCPIP communication, reference may be madeto FIG. 3, wherein the Web server is a TCPIP server.

In TCPIP there are three communication commands that are of particularinterest, namely, connect, write, and read. Connect is a command issuedby an application in the communication device that is initiating thecommunication to instruct the TCPIP stack to connect to a remotecommunication device. The connect message includes the IP address of thecommunication device, and the port number to connect to. An applicationuses the write command to instruct the TCPIP stack to send a message(i.e., data) to a communication device to which it is connected. Inaddition, an application uses the read command to ask the TCPIP stack toprovide the message that was sent from the remote communication deviceto which it is connected. A communication session typically exists of aconnect, followed by a read and write on both sides.

FIG. 14 is a flowchart 600 further illustrating TCPIP acceleration inaccordance with this alternative embodiment of the invention. As shownby blocks 601 and 602 when an application of the communication devicemakes a request to the communications stack to connect with the TCPIPserver, that communication is intercepted by the accelerationapplication.

To find an agent, upon receiving that connect message from thecommunication device application, which includes the IP address of theTCPIP server and the port to connect to, the acceleration application inthe client makes a request to the acceleration server to find out whothe agent for the communication with the TCPIP server is. This step isperformed in a similar manner to that described with regard to the mainHTTP embodiment of the invention (block 604). As shown by block 606, theserver then provides the client with a list of agents, for example, aprimary agent and four others.

To establish a connection, as shown by block 608, the client issues aTCPIP connect with the primary agent or one of the other agents if theprimary agent does not succeed, to create a connection with the agent.The client then sends to the agent the IP address of the TCPIP serverand connection port that were provided by the communication deviceapplication (block 610). As shown by block 612, that agent in turnissues a TCPIP connect to the TCPIP server to the port it received fromthe client, to create a connection with the agent.

FIG. 15 is a flowchart 800 further illustrating TCPIP acceleration inaccordance with this alternative embodiment of the invention, detailingthe communication between the client and the TCPIP server (read andwrite commands) after the connect phase has completed successfully.

As shown by block 802, if the network application within the clientwants to send a message to the TCPIP server, the network applicationwithin the client writes the message to the TCPIP stack in the operatingsystem of the client. This WRITE command is received by the accelerationapplication of the client and handled in the manner described below. Ifthe TCPIP server wants to send a message to the client, the TCPIP serverwrites the message to the TCPIP stack of TCPIP operating system, on theconnection to the agent, since this agent is where the server receivedthe original connection. This WRITE command is received by theacceleration application of the agent and handled in the mannerdescribed below.

When the acceleration application of the client receives a message fromthe network application of the client to be sent to the agent, or whenthe acceleration application of the agent receives a message from theconnection to the TCPIP server that is to be sent to the client, theacceleration application proceeds to send the message to thecommunication device on the other side. For instance, if the client hasintercepted the message from the communication application, the clientsends the message to the agent, and if it is the agent that interceptedthe message from the connection to the TCPIP server, such as the TCPIPserver sending a message that is intended for the communication withclient, the agent sends the message to the client in the followingmanner:

As shown by block 804, the acceleration application breaks up thecontent of the message to chunks and calculates the correspondingchecksums, in the same manner as in the main embodiment describedherein. The acceleration application then looks up each checksum in itscache database (block 806). As shown by block 808, the accelerationapplication checks if the checksum exists in the cache database. Hitdoes, then, as shown by block 810, the acceleration application preparesa list of peers that have already received the chunk of the checksum inthe past (if any), and adds the communication device of the other sideto the list of communication devices that have received this chunk (addsit to the peer list of the checksum in its database), to be provided toother communication devices requesting this information in the future.As shown by block 812, the list of peers is sent to the receivingcommunication device, which, as shown by block 814 retrieves the chunksfrom the peers in the list received, in the same manner as in the mainembodiment.

If the checksum does not exist within the cache database of the sendingcommunication device then, as shown by block 820, the accelerationapplication adds the checksum and chunk to its cache database, sends thechunk to the communication device on the other side, and adds the othercommunication device to the list of peers for that checksum in itsdatabase.

As shown by block 816, a determination is then made as to whether allchunks have been received. If all chunks have not been received, theprocess continues on again from block 806.

Once all data has been received, as shown by block 818, the accelerationapplication passes the data on to the requester. Specifically, in theclient, the acceleration application passes on the complete data to thecommunication application, and in the agent, the accelerationapplication passes on the complete data to the requesting TCPIP server.

It should be emphasized that the above-described embodiments of thepresent invention are merely possible examples of implementations,merely set forth for a clear understanding of the principles of theinvention. Many variations and modifications may be made to theabove-described embodiments of the invention without departingsubstantially from the spirit and principles of the invention. All suchmodifications and variations are intended to be included herein withinthe scope of this disclosure and the present invention and protected bythe following claims.

1. A method for use with a first server, for use with a second serverthat comprises a web server that is a Hypertext Transfer Protocol (HTTP)server responding to HTTP requests and addressed in the Internet using aweb server Internet Protocol (IP) address, the second server stores afirst content identified by a first content identifier, and for use withfirst and second client devices, each of the client devices is operativeto communicate over the Internet with the first and second servers, themethod by the first server comprising: receiving, from the first clientdevice, a first message that comprises the web server IP address or thefirst content identifier; sending, in response to the receiving of thefirst message, the first content identifier to the second client device;receiving, in response to the sending of the first content identifier,the first content, or a part thereof, from the second client device; andsending, the received first content, or the part thereof, to the firstclient device.
 2. The method according to claim 1, wherein the first andsecond client devices are respectively addressed over the Internet usingfirst and second Internet Protocol (IP) addresses, and the methodfurther comprising storing, in the first server, the first or second IPaddress.
 3. The method according to claim 1, wherein the first server isa Transmission Control Protocol/Internet Protocol (TCP/IP) server thatcommunicates over the Internet with the first or second client devicebased on, according to, or using, TCP/IP protocol or connection.
 4. Themethod according to claim 1, wherein the first server communicates overthe Internet based on, or according to, one out of UDP, DNS, TCP, FTP,POP*, SMTP, or SQL standards.
 5. The method according to claim 1,wherein the first content comprises web-page, audio, or video content,and wherein the first content identifier comprises a Uniform ResourceLocator (URL).
 6. The method according to claim 1, for use with aplurality of client devices that includes the second client device, eachidentified over the Internet using a respective IP address, wherein thefirst server stores a list of the IP addresses of the client devices ofthe plurality of client devices, and wherein the method furthercomprising: selecting, by the first server, multiple client devices fromthe plurality of client devices by selecting the IP addresses of themultiple client devices from the list; and sending, by the first server,the selected IP addresses in response to the selecting.
 7. The methodaccording to claim 6, wherein the sending of the selected IP addressescomprises sending to the first client device.
 8. The method according toclaim 6, further comprising responsive to the receiving of the firstmessage from the first client device, adding the first client device tothe plurality of client devices by including the IP address of the firstdevice to the list.
 9. The method according to claim 6, for use with athird client device, the method further comprising: sending, by thefirst server, a ‘keep alive’ message to the third client device; andwaiting, by the first server, for a response to the ‘keep alive’ messagefrom the third client device.
 10. The method according to claim 9,further comprising: receiving, by the first server, the response to the‘keep alive’ message from the third client device; and responsive to thereceiving of the response, adding the third client device to theplurality of client devices by including the IP address of the thirddevice to the list.
 11. The method according to claim 9, furthercomprising responsive to not receiving, by the first server, a responseto the ‘keep alive’ message from the third client device, removing thethird client device from the plurality of client devices by removing theIP address of the third device from the list.
 12. The method accordingto claim 9, wherein the sending of the ‘keep alive’ message comprisesperiodically sending by the first server the ‘keep alive’ message to thethird client device.
 13. The method according to claim 1, for use with afirst plurality of client devices that includes the second clientdevice, each identified over the Internet using a respective IP address,wherein the first server stores a first list of the IP addresses of theclient devices in the first plurality of client devices, wherein themethod further comprising selecting, by the first server, the secondclient device from the first plurality of client devices by selectingthe IP address of the second client device from the first list, andwherein the sending of the first content identifier to the second clientdevice is in response to the selecting.
 14. The method according toclaim 13, wherein the first plurality of client devices comprisescurrently online client devices.
 15. The method according to claim 13,further comprising: receiving, a second message by the first server froma third client device that is identified over the Internet using a thirdIP address; and adding, by the first server in response to the receivingof the second message, the third client device to the first plurality ofclient devices by adding the third IP address to the first list.
 16. Themethod according to claim 13, for use with a criterion stored in thefirst server, wherein the selecting of the second client device isaccording to, or based on, the criterion.
 17. The method according toclaim 16, wherein the criterion is based on, or comprises, a numericalcloseness to the web server IP address.
 18. The method according toclaim 16, wherein the criterion is based on, or comprises, ageographical location of the selected client device, or a response timewhen communicating.
 19. The method according to claim 13, for use with asecond plurality of client devices that is non-overlapping with thefirst plurality of client devices and that includes a third clientdevice, each identified over the Internet using a respective IP address,wherein the first server stores a second list of the IP addresses of theclient devices in the second plurality of client devices, and whereinthe method further comprising: selecting, by the first server, the thirdclient device from the second plurality of client devices by selectingthe IP address of the third client device from the second list; andsending of the first content identifier to the third client device inresponse to the selecting.
 20. The method according to claim 1, furthercomprising establishing, by the first server, a Transmission ControlProtocol (TCP) connection with the first or second client device. 21.The method according to claim 1, wherein the first client device isidentified by a first Internet Protocol (IP) address, Media AccessControl (MAC) address, or a hostname, and wherein the first messagefurther comprises the first IP address, the MAC address, or thehostname.
 22. The method according to claim 1, for use with a softwareapplication stored in the first server and associated with a firstversion number, and wherein the method further comprising sending, bythe first server to the first or second client device, a message thatcomprises the first version number of the software application.
 23. Themethod according to claim 22, further comprising sending, by the firstserver to the first or second client device, the first softwareapplication.
 24. The method according to claim 1, further comprisingstoring, operating, or using, a server operating system.
 25. The methodaccording to claim 1, wherein the steps are sequentially executed. 26.The method according to claim 1, for use with a software applicationthat includes computer instructions that, when executed by a computerprocessor, cause the processor to perform the steps of the claim
 1. 27.A non-transitory computer readable medium containing computerinstructions that, when executed by a computer processor, cause theprocessor to perform the method according to claim
 1. 28. A serverdevice comprising a non-transitory computer readable medium containingcomputer instructions that, when executed by a computer processor, causethe processor to perform the method according to claim 1.